|
In graph theory, the modular product of graphs ''G'' and ''H'' is a graph such that * the vertex set of the modular product of ''G'' and ''H'' is the cartesian product ''V''(''G'') × ''V''(''H''); and * any two vertices (''u'', ''v'') and (''u' '', ''v' '') are adjacent in the modular product of ''G'' and ''H'' if and only if either * * ''u'' is adjacent with ''u' '' and ''v'' is adjacent with ''v' '', or * * ''u'' is not adjacent with ''u' '' and ''v'' is not adjacent with ''v' ''. Cliques in the modular product graph correspond to isomorphisms of induced subgraphs of ''G'' and ''H''. Therefore, the modular product graph can be used to reduce problems of induced subgraph isomorphism to problems of finding cliques in graphs. Specifically, the largest graph that is an induced subgraph of both ''G'' and ''H'' corresponds to the maximum clique in their modular product. Although the problems of finding largest common induced subgraphs and of finding maximum cliques are both NP-complete, this reduction allows clique-finding algorithms to be applied to the common subgraph problem. ==References== *. *. *. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Modular product of graphs」の詳細全文を読む スポンサード リンク
|